An improved upper bound in the maximum dispersal problem
نویسندگان
چکیده
منابع مشابه
An improved bound on the maximum agreement subtree problem
We improve the lower bound on the extremal version of the Maximum Agreement Subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is identity on the leaves.
متن کاملAn Improved Upper Bound for the Three Dimensional Dimer Problem
Let n be even and denote by f (n) the number of domino tilings of a cube of side n. The three dimensional dimer problem is to determine the limit`3 := limn!1(log f (n))=n 3 (which is known to exist). The best previously known upper bound was found by Minc and is 1=12 log 6! = 0:54827:::. In this paper we improve this bound to 0.463107.
متن کاملAn Improved Upper Bound for Leo Moser's Worm Problem
A worm ω is a continuous rectifiable arc of unit length in the Cartesian plane. Let W denote the class of all worms. A planar region C is called a cover for W if it contains a copy of every worm in W . That is, C will cover or contain any member ω of W after an appropriate translation and/or rotation ofω is completed (no reflections). The open problem of determining a cover C of smallest area i...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملAn Upper Bound in Goldbach's Problem
It is clear that the number of distinct representations of a number n as the sum of two primes is at most the number of primes in the interval [n/2, n-2]. We show that 210 is the largest value of n for which this upper bound is attained.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1974
ISSN: 0024-3795
DOI: 10.1016/0024-3795(74)90081-0